Quadrature formulae for Fourier coefficients
نویسندگان
چکیده
We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node formula for the Fourier-Tchebycheff coefficients given by Michhelli and Sharma and construct new Gaussian formulas for the Fourier coefficients of a function, based on the values of the function and its derivatives. AMS subject classification: 65D32, 65D30, 41A55
منابع مشابه
Kronrod extensions with multiple nodes of quadrature formulas for Fourier coefficients
We continue with analyzing quadrature formulas of high degree of precision for computing the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials, started recently by Bojanov and Petrova [Quadrature formulae for Fourier coefficients, J. Comput. Appl. Math. 231 (2009), 378–391] and we extend their results. Construction of new Gaussian quadrature form...
متن کاملFast evaluation of quadrature formulae on the sphere
Recently, a fast approximate algorithm for the evaluation of expansions in terms of standard L2 ( S2 ) -orthonormal spherical harmonics at arbitrary nodes on the sphere S2 has been proposed in [S. Kunis and D. Potts. Fast spherical Fourier algorithms. J. Comput. Appl. Math., 161:75 – 98, 2003]. The aim of this paper is to develop a new fast algorithm for the adjoint problem which can be used to...
متن کاملStieltjes polynomials and related quadrature formulae for a class of weight functions
Consider a (nonnegative) measure dσ with support in the interval [a, b] such that the respective orthogonal polynomials, above a specific index `, satisfy a three-term recurrence relation with constant coefficients. We show that the corresponding Stieltjes polynomials, above the index 2` − 1, have a very simple and useful representation in terms of the orthogonal polynomials. As a result of thi...
متن کاملShort Communication Gauss Legendre quadrature over a triangle
This paper presents a Gauss Legendre quadrature method for numerical integration over the standard triangular surface: {(x, y) | 0 , 1, 1} x y x y ≤ ≤ + ≤ in the Cartesian two-dimensional (x, y) space. Mathematical transformation from (x, y) space to (ξ, η) space map the standard triangle in (x, y) space to a standard 2-square in (ξ, η) space: {(ξ, η)|–1 ≤ ξ, η ≤ 1}. This overcomes the difficul...
متن کاملThe Application of the Fast Fourier Transform to Jacobi Polynomial expansions
We observe that the exact connection coefficient relations transforming modal coefficients of one Jacobi Polynomial class to the modal coefficients of certain other classes are sparse. Because of this, when one of the classes corresponds to the Chebyshev case, the Fast Fourier Transform can be used to quickly compute modal coefficients for Jacobi Polynomial expansions of class (α, β) when 2α an...
متن کامل